Random-Access Machines and the Extended Church-Turing Thesis
نویسندگان
چکیده
We show that a random-access machine (RAM) can simulate any effective algorithm with only constant overhead of time, thereby supporting the Extended Church-Turing Thesis.
منابع مشابه
The Computational Complexity of Evolving Systems
The work in this thesis has been carried out under the auspices of the research school IPA (Institute for Programming research and Algorithmics). Introduction Models for computational devices are crucial to many fields of computer science. Without a suitable model, there is no foundation to base one's theories on. Choosing a proper model for a computational phenomenon is not an easy task. If th...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملQuantum Speed-up of Computations
1. The Physical Church-Turing Thesis. Physicists often interpret the Church-Turing Thesis as saying something about the scope and limitations of physical computing machines. Although this was not the intention of Church or Turing, the Physical Church Turing thesis is interesting in its own right. Consider, for example, Wolfram's formulation: One can expect in fact that universal computers are a...
متن کاملOn the Optimality of RAM Complexity
We demonstrate that the programs of any classical (as opposed to parallel or interactive) computation model or programming language that satisfies natural postulates of effectiveness (which specialize Gurevich’s Sequential Postulates)—regardless of the data structures it employs—can be simulated by a random access machine (RAM) with only constant overhead. In essence, the effectiveness postulat...
متن کاملThe Role of Interference and Entanglement in Quantum Computing
ii Preface Prelude The year is 1900. The world's most renowned mathematician, David Hilbert, proposes 10 challenging mathematical problems for the nascent century at the second international congress in Paris. One of these problems, the Entscheidungsproblem, asks if there exists an algorithm that decides whether a first-order statement is derivable from the axioms of first-order predicate calcu...
متن کامل